Computational complexity of mathematical operations

Results: 76



#Item
31Generation of Efficient Algorithms for Maximum Marking Problems (和訳: 最大マーク付け問題の効率的解法の自動生成) Isao Sasano

Generation of Efficient Algorithms for Maximum Marking Problems (和訳: 最大マーク付け問題の効率的解法の自動生成) Isao Sasano

Add to Reading List

Source URL: www.sic.shibaura-it.ac.jp

Language: English - Date: 2014-02-04 09:21:05
32Potential and Challenges of Two-VariablePer-Inequality Sub-Polyhedral Compilation Ramakrishna Upadrasta Albert Cohen INRIA and LRI, Paris-Sud 11 University

Potential and Challenges of Two-VariablePer-Inequality Sub-Polyhedral Compilation Ramakrishna Upadrasta Albert Cohen INRIA and LRI, Paris-Sud 11 University

Add to Reading List

Source URL: perso.ens-lyon.fr

Language: English - Date: 2011-03-29 07:21:24
33Channel Based Scheduling of Parallelizable Tasks Jason Glasgow CenterLine Software Cambridge, MA, USA 

Channel Based Scheduling of Parallelizable Tasks Jason Glasgow CenterLine Software Cambridge, MA, USA 

Add to Reading List

Source URL: www.cs.technion.ac.il

Language: English - Date: 2013-04-17 12:08:56
34Quality Guarantees on k-Optimal Solutions for Distributed Constraint Optimization Problems Jonathan P. Pearce and Milind Tambe∗ University of Southern California Computer Science Department {, tambe@usc

Quality Guarantees on k-Optimal Solutions for Distributed Constraint Optimization Problems Jonathan P. Pearce and Milind Tambe∗ University of Southern California Computer Science Department {, tambe@usc

Add to Reading List

Source URL: teamcore.usc.edu

Language: English - Date: 2008-10-14 04:00:37
35Hilldale Lecture Series In pursuit of the traveling salesman: Mathematics at the limits of computation

Hilldale Lecture Series In pursuit of the traveling salesman: Mathematics at the limits of computation

Add to Reading List

Source URL: www.secfac.wisc.edu

Language: English - Date: 2014-10-24 10:53:47
36(Nearly) Sample-Optimal Sparse Fourier Transform Piotr Indyk MIT Michael Kapralov MIT∗

(Nearly) Sample-Optimal Sparse Fourier Transform Piotr Indyk MIT Michael Kapralov MIT∗

Add to Reading List

Source URL: people.csail.mit.edu

Language: English - Date: 2014-12-09 10:13:50
37counting colours in compressed strings Travis Gagie Juha K¨arkk¨ainen CPM 2011

counting colours in compressed strings Travis Gagie Juha K¨arkk¨ainen CPM 2011

Add to Reading List

Source URL: www.cs.ucr.edu

Language: English - Date: 2011-09-22 14:04:56
38Multi-Objective Optimisation on Transportation Networks Dan Costelloe, Peter Mooney and Adam Winstanley. Department of Computer Science, National University of Ireland Maynooth (NUIM), Co. Kildare. Ireland. Telephone: +3

Multi-Objective Optimisation on Transportation Networks Dan Costelloe, Peter Mooney and Adam Winstanley. Department of Computer Science, National University of Ireland Maynooth (NUIM), Co. Kildare. Ireland. Telephone: +3

Add to Reading List

Source URL: itcnt05.itc.nl

Language: English - Date: 2005-02-02 17:00:00
39The Mathematics of Algorithm Design about all these algorithms without recourse to specific computing devices or computer programming languages, instead expressing them using the language of mathematics. In fact, the not

The Mathematics of Algorithm Design about all these algorithms without recourse to specific computing devices or computer programming languages, instead expressing them using the language of mathematics. In fact, the not

Add to Reading List

Source URL: www.cs.cornell.edu

Language: English - Date: 2006-02-14 23:00:29
40Syntactic Characterizations of Polynomial Time Optimization Classes Prabhu Manyem School of Information Technology and Mathematical Sciences University of Ballarat Mount Helen, VIC 3350, Australia.

Syntactic Characterizations of Polynomial Time Optimization Classes Prabhu Manyem School of Information Technology and Mathematical Sciences University of Ballarat Mount Helen, VIC 3350, Australia.

Add to Reading List

Source URL: cjtcs.cs.uchicago.edu

Language: English - Date: 2008-07-15 06:05:48